Solutions of a constrained Hermitian matrix-valued function optimization problem with applications
نویسنده
چکیده
Abstract. Let f(X) = (XC + D )M(XC + D) − G be a given nonlinear Hermitian matrix-valued function with M = M∗ and G = G∗, and assume that the variable matrix X satisfies the consistent linear matrix equation XA = B. This paper shows how to characterize the semi-definiteness of f(X) subject to all solutions of XA = B. As applications, a standard method is obtained for finding analytical solutions X0 of X0A = B such that the matrix inequality f(X) < f(X0) or f(X) 4 f(X0) holds for all solutions of XA = B. The whole work provides direct access, as a standard example, to a very simple algebraic treatment of the constrained Hermitian matrix-valued function and the corresponding semi-definiteness and optimization problems.
منابع مشابه
An iterative method for the Hermitian-generalized Hamiltonian solutions to the inverse problem AX=B with a submatrix constraint
In this paper, an iterative method is proposed for solving the matrix inverse problem $AX=B$ for Hermitian-generalized Hamiltonian matrices with a submatrix constraint. By this iterative method, for any initial matrix $A_0$, a solution $A^*$ can be obtained in finite iteration steps in the absence of roundoff errors, and the solution with least norm can be obtained by choosing a special kind of...
متن کاملOn the hybrid conjugate gradient method for solving fuzzy optimization problem
In this paper we consider a constrained optimization problem where the objectives are fuzzy functions (fuzzy-valued functions). Fuzzy constrained Optimization (FO) problem plays an important role in many fields, including mathematics, engineering, statistics and so on. In the other side, in the real situations, it is important to know how may obtain its numerical solution of a given interesting...
متن کاملOptimization algorithms exploiting unitary constraints
This paper presents novel algorithms that iteratively converge to a local minimum of a real-valued function ( ) subject to the constraint that the columns of the complex-valued matrix are mutually orthogonal and have unit norm. The algorithms are derived by reformulating the constrained optimization problem as an unconstrained one on a suitable manifold. This significantly reduces the dimension...
متن کاملProposing a Constrained-GSA for the Vehicle Routing Problem
In the past decades, vehicle routing problem (VRP) has gained considerable attention for its applications in industry, military, and transportation applications. Vehicle routing problem with simultaneous pickup and delivery is an extension of the VRP. This problem is an NP-hard problem; hence finding the best solution for this problem which is using exact method, take inappropriate time, and th...
متن کاملAn efficient one-layer recurrent neural network for solving a class of nonsmooth optimization problems
Constrained optimization problems have a wide range of applications in science, economics, and engineering. In this paper, a neural network model is proposed to solve a class of nonsmooth constrained optimization problems with a nonsmooth convex objective function subject to nonlinear inequality and affine equality constraints. It is a one-layer non-penalty recurrent neural network based on the...
متن کامل